D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
نویسندگان
چکیده
منابع مشابه
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
In this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms have been designed, but only a few of them found their way into implementation. The main obstacle is the lack of easy-to-use systems which (i) take care of building a tree decomposition and (ii) provide an interface f...
متن کاملAnswer Set Programming and Declarative Problem Solving in Game AIs
Designing and implementing AI in games is an interesting, yet complex task. This paper briefly presents some applications that make use of Answer Set Programming for such a task, and show some advantages of declarative programming frameworks against imperative (algorithmic) approaches while dealing with knowledge representation and reasoning: solid theoretical bases, no need for algorithm desig...
متن کاملThe D-FLAT System for Dynamic Programming on Tree Decompositions
Complex reasoning problems over large amounts of data pose a great challenge for computer science. To overcome the obstacle of high computational complexity, exploiting structure by means of tree decompositions has proved to be effective in many cases. However, the implementation of suitable efficient algorithms is often tedious. D-FLAT is a software system that combines the logic programming l...
متن کاملDeclarative Query Tuning and Optimization using Answer Set Programming
In [2, Chapter 14], Lewis describes the basics behind the procedure used by the oracle query optimizer for computing the optimal join order for a sample query. Given a set T of n pairs table:cost, a join order is a full binary tree such that (i) T is the set of its leaves, (ii) the right child of an inner node is a leaf, and (iii) each inner node is a pair join tag:cost where join tag is either...
متن کاملGrounding and Solving in Answer Set Programming
modeling language with effective grounding and solving technology. Moreover, ASP is highly versatile by offering various elaborate language constructs and a whole spectrum of reasoning modes. The work flow of ASP is illustrated in figure 1. At first, a problem is expressed as a logic program. A grounder systematically replaces all variables in the program by (variable-free) terms, and the solve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2012
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068412000129